Polarized Associative Algebras1

نویسنده

  • Xiaoping Xu
چکیده

Poisson superpair is a pair of Poisson superalgebra structures on a super commutative associative algebra, whose any linear combination is also a Poisson superalgebra structure. In this paper, we first construct certain linear and quadratic Poisson superpairs over a finite-dimensional or semi-finitely-filtered polarized Z2-graded associative algebra. Then we give a construction of certain Hamiltonian superpairs in the formal variational calculus over any finite-dimensional Z2-graded associative algebra with a supersymmetric nondegenerate associative bilinear form. Our constructions are based on the Adler mapping in a general sense. Our works in this paper can be viewed as noncommutative generalizations of the Adler-Gel’fand-Dikii Hamiltonian pair. As a preparatory work, some structural properties of polarized associative algebras have been studied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Poisson and Hamiltonian Superpairs over Polarized Associative Algebras1

Poisson superpair is a pair of Poisson superalgebra structures on a super commutative associative algebra, whose any linear combination is also a Poisson superalgebra structure. In this paper, we first construct certain linear and quadratic Poisson superpairs over a semi-finitely-filtered polarized Z2-graded associative algebra. Then we give a construction of certain Hamiltonian superpairs in t...

متن کامل

Block Idempotents of Twisted Group Algebras1

In [4] Conlon has successfully generalized much of the theory of modular representations to the projective case. However his generalization [4, p. 166] of one of Brauer's main theorems on blocks [3, 10B], [5] is not entirely satisfactory. In Theorem 1 we present another generalization which is closer than Conlon's to the original Brauer theorem, and in Theorem 2 we indicate an application invol...

متن کامل

The Non-associativity of Polarized Tree-Based Grammars

Polarities are used to sanction grammar fragment combination in high level tree-based formalisms such as eXtenssible MetaGrammar (XMG) and polarized unification grammars (PUG). We show that attaching polarities to tree nodes renders the combination operation non-associative, and in practice leads to overgeneration. We first provide some examples of non-associative combination operators in exist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000